Integral domains finite over each underring
نویسندگان
چکیده
منابع مشابه
Values of Polynomials over Integral Domains
It is well known that no nonconstant polynomial with integer coefficients can take on only prime values. We isolate the property of the integers that accounts for this, and give several examples of integral domains for which there are polynomials that only take on unit or prime values. Throughout this note, we let R denote an arbitrary UFD (unique factorization domain) that is not a field. Of c...
متن کاملIntegral point sets over finite fields
We consider point sets in the affine plane Fq where each Euclidean distance of two points is an element of Fq . These sets are called integral point sets and were originally defined in m-dimensional Euclidean spaces Em. We determine their maximal cardinality I(Fq , 2). For arbitrary commutative rings R instead of Fq or for further restrictions as no three points on a line or no four points on a...
متن کاملSolving Hierarchical Constraints over Finite Domains
Many real world problems have requirements and constraints which connict with each other and are not well deened. One framework for dealing with such over-constrained/fuzzy problems is provided by constraint hierarchies where constraints are divided into required and preferred with strengths and a comparator to select preferred solutions over others. In this paper, we examine techniques for sol...
متن کاملConstraint functional logic programming over finite domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried ...
متن کاملModular Logic Programs over Finite Domains
In this paper we study the properties of a compositional semantics for logic programs and its applications to modular analysis and logic-based databases, focusing on programs deened on a nite domain (i.e. on a function free nite signature). By this restriction we obtain a nite characterization of the compositional semantics which has the same correctness and compositionality properties of the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsukuba Journal of Mathematics
سال: 1991
ISSN: 0387-4982
DOI: 10.21099/tkbjm/1496161666